منابع مشابه
Supertrees Based on the Subtree Prune-and-Regraft Distance
Supertree methods reconcile a set of phylogenetic trees into a single structure that is often interpreted as a branching history of species. A key challenge is combining conflicting evolutionary histories that are due to artifacts of phylogenetic reconstruction and phenomena such as lateral gene transfer (LGT). Many supertree approaches use optimality criteria that do not reflect underlying pro...
متن کاملChain Reduction Preserves the Unrooted Subtree Prune-and-Regraft Distance
The subtree prune-and-regraft (SPR) distance metric is a fundamental way of comparing evolutionary trees. It has wide-ranging applications, such as to study lateral genetic transfer, viral recombination, and Markov chain Monte Carlo phylogenetic inference. Although the rooted version of SPR distance can be computed relatively efficiently between rooted trees using fixed-parameter-tractable algo...
متن کاملCalculating the Unrooted Subtree Prune-and-Regraft Distance
The subtree prune-and-regraft (SPR) distance metric is a fundamen-tal way of comparing evolutionary trees. It has wide-ranging applications,such as to study lateral genetic transfer, viral recombination, and Markovchain Monte Carlo phylogenetic inference. Although the rooted versionof SPR distance can be computed relatively efficiently between rootedtrees using fixed-paramet...
متن کاملOn the Computational Complexity of the Rooted Subtree Prune and Regraft Distance
The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore...
متن کاملA practical method for exact computation of subtree prune and regraft distance
MOTIVATION Subtree prune and regraft (SPR) is one kind of tree rearrangements that has seen applications in solving several computational biology problems. The minimum number of rooted SPR ((r)SPR) operations needed to transform one rooted binary tree to another is called the (r)SPR distance between the two trees. Computing the (r)SPR distance has been actively studied in recent years. Currentl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/7860